Easiness in graph models
نویسندگان
چکیده
منابع مشابه
Easiness in graph models
We generalize Baeten and Boerboom’s method of forcing, and apply this to show that there is a fixed sequence (uk)k∈ω of closed (untyped) λ-terms satisfying the following properties: a) For any countable sequence (gk)k∈ω of continuous functions (of arbitrary arity) on the power set of an arbitrary countable set, there is a graph model such that (λx.xx)(λx.xx)uk represents gk in the model. b) For...
متن کاملEasiness Amplification and Uniform Circuit Lower Bounds
We present new consequences of the assumption that time-bounded algorithms can be “compressed” with non-uniform circuits. Our main contribution is an “easiness amplification” lemma for circuits. One instantiation of the lemma says: if n1+ε-time, Õ(n)-space computations have n1+o(1) size (non-uniform) circuits for some ε > 0, then every problem solvable in polynomial time and Õ(n) space has n1+o...
متن کاملInvestigating the functional communication network in patients with knee osteoarthritis using graph-based statistical models
Introduction: Osteoarthritis of the knee is the most prevalent type of arthritis that causes persistent pain and reduces the quality of life. However, no treatment alleviates symptoms or stops the disease from progressing. Functional magnetic resonance imaging (fMRI) studies can provide information on neural mechanisms of pain by assessing correlation patterns among the different regions of the...
متن کاملGraph Problems in Streaming Models
In this report I will focus on the research activity carried on during the first year of my PhD program, at the University of Rome “La Sapienza”. I will first introduce and motivate several computational models for massive data sets, then give an overview of the results obtained within the framework of those models, mainly relatively to a specific, but relevant class of problems (namely, graph ...
متن کاملRandom graph models for the web graph
One of the most extensively researched real-world networks is the web graph. The web graph has vertices representing web pages, with edges corresponding to the links between pages. We describe some of the key properties of the web graph and propose models to simulate its evolution. We survey more recent work on geometric models, where nodes occupy some geometric space and edges are created via ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2006
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2005.11.005